Generalizations of Chebyshev polynomials and Polynomial Mappings
نویسندگان
چکیده
In this paper we show how polynomial mappings of degree K from a union of disjoint intervals onto [−1, 1] generate a countable number of special cases of generalizations of Chebyshev polynomials. We also derive a new expression for these generalized Chebyshev polynomials for any genus g, from which the coefficients of xn can be found explicitly in terms of the branch points and the recurrence coefficients. We find that this representation is useful for specializing to polynomial mapping cases for small K where we will have explicit expressions for the recurrence coefficients in terms of the branch points. We study in detail certain special cases of the polynomials for small degree mappings and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an explicit expression for the discriminant for the genus 1 case of our Chebyshev polynomials that is valid for any configuration of the branch point. Running title: Chebyshev Polynomials, Generalized . † e-mail: [email protected] †† e-mail:[email protected] ††† e-mail :[email protected]
منابع مشابه
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کاملOn Multivariate Chebyshev Polynomials and Spectral Approximations on Triangles
In this paper we describe the use of multivariate Chebyshev polynomials in computing spectral derivations and Clenshaw–Curtis type quadratures. The multivariate Chebyshev polynomials give a spectrally accurate approximation of smooth multivariate functions. In particular we investigate polynomials derived from the A2 root system. We provide analytic formulas for the gradient and integral of A2 ...
متن کاملGeneralizations and Specializations of Generating Functions for Jacobi, Gegenbauer, Chebyshev and Legendre Polynomials with Definite Integrals
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer polynomials through extension a two element sequence of generating functions for Jacobi polynomials. Specializations of generating functions are accomplished throu...
متن کاملOn the uniform convergence of the Chebyshev interpolants for solitons
We discuss polynomial interpolation and derive sufficient conditions for the uniform convergence of Chebyshev interpolants for different classes of functions. Rigorous results are illustrated with a number of examples which include solitons on an infinite line with algebraic, exponential and Gaussian decay rates. Suitable mappings of the real line to the interval [−1, 1] are considered for each...
متن کامل